Fourier Transform of SAR Data Cube and 3-D Range Migration Algorithm

نویسندگان

چکیده

To develop a 3-D imaging synthetic aperture radar(SAR) algorithm, theoretical expression for Fourier transform of data cube is required. In this article, we introduce function representing the SAR cube. The derived using method stationary phase and similar to one used 2-D matrix. For verification evaluation, range migration algorithm bulk compression examined. simulation results based on parameters an experimental terahertz indoor testbed show that can well focus image and, hence, verify function. quality assessments such as spatial resolutions peak sidelobe ratio are further evaluate algorithm. measured compared with ones provided by backprojection

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Extension of Range Migration Algorithm for Airborne SAR Data Processing

Abstract: Several algorithms have been developed for the data processing of spotlight synthetic aperture radar (SAR). In particular, the range migration algorithm (RMA) does not assume that illuminating wavefronts are planar. Also, a high resolution image can be obtained by the RMA. This paper introduces an extension of the original RMA to enable a more efficient airborne SAR data processing. W...

متن کامل

2-D Left-Side Quaternion Discrete Fourier Transform: Fast Algorithm

We describe a fast algorithm for the 2-D left-side QDFT which is based on the concept of the tensor representation when the color or four-componnrnt quaternion image is described by a set of 1-D quaternion signals and the 1-D left-side QDFTs over these signals determine values of the 2-D left-side QDFT at corresponding subset of frequency-points. The efficiency of the tensor algorithm for calcu...

متن کامل

Fractional-Fourier-transform calculation through the fast-Fourier-transform algorithm.

A method for the calculation of the fractional Fourier transform (FRT) by means of the fast Fourier transform (FFT) algorithm is presented. The process involves mainly two FFT's in cascade; thus the process has the same complexity as this algorithm. The method is valid for fractional orders varying from -1 to 1. Scaling factors for the FRT and Fresnel diffraction when calculated through the FFT...

متن کامل

Using Fast Fourier Transform in the 3-d Multilevel Fast Multipole Algorithm

In this paper a method is presented how to perform interpolation and anterpolation in both spherical coordinates θ and φ by trigonometric polynomials and the fast Fourier transform (FFT) in the 3-D multilevel fast multipole algorithm (MLFMA). The proposed method is exact in interpolation and anterpolation, and has the high numerical efficiency of FFT. A numerical comparison suggests that the pr...

متن کامل

3-d Symmetry Detection Using the Pseudo-polar Fourier Transform

Symmetry detection in 3D images is an important task in many fields such as computer vision, pattern recognition to name a few. An algebraic based 3D symmetry detection algorithm is presented. The 3D volume is transformed to the Fourier domain by using the pseudo-polar Fourier transform. The pseudo-polar representation enables to analyze angular properties such as finite symmetric properties th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Aerospace and Electronic Systems

سال: 2022

ISSN: ['1557-9603', '0018-9251', '2371-9877']

DOI: https://doi.org/10.1109/taes.2021.3134724